Mathematical political districting taking care of minority groups
نویسندگان
چکیده
Abstract Political districting (PD) is a wide studied topic in the literature since 60s. It typically requires multi-criteria approach, and mathematical programs are frequently suggested to model many aspects of this difficult problem. This implies that exact models cannot be solved optimality when size territory too large. In spite this, an formulation can also exploited heuristic framework find at least sub-optimal solution for large problem instances. We study design electoral districts Mexico, where population characterized by presence minority groups (“indigenous community”) who have special right represented Parliament. For Mexican law prescribes fixed number must designed support representation indigenous community. formulate mixed integer linear (MILP) following these two principles, but including basic PD criteria contiguity balance. The district map obtained stages: first we produce established Law; then complete forming non-indigenous districts. two-phase approach has advantages: dedicated objective function formulated Phase 1 form best; second phase instance reduced (both territorial units districts) so computational effort solve as well. test our procedure on Chiapas Mexico some fictitious instances which grid graph. compare with Institutional one currently adopted Chiapas.
منابع مشابه
Measuring the Compactness of Political Districting Plans
We develop a measure of compactness based on the distance between voters within the same district relative to the minimum distance achievable, which we coin the relative proximity index. Any compactness measure that satisfies three desirable properties (anonymity of voters, efficient clustering, and invariance to scale, population density, and number of districts) ranks districting plans identi...
متن کاملThe Political Districting Problem: A Survey*
Computer scientists and social scientists consider the political districting problem from different viewpoints. This paper gives an overview of both strands of the literature on districting in which the connections and the differences between the two approaches are highlighted.
متن کاملWeighted Voronoi Region Algorithms for Political Districting
Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can be modelled as multiobjective partitioning of a graph into connected components, where population equality and compactness must hold if a majority voting rule is adopted. This leads to the formulation of combinatorial...
متن کاملA Multistart Constructive Heuristic Algorithm for Political Districting
For better or worse, state legislators are responsible for redistricting their state every ten years when new census data becomes available. Historically, it has often been a hard fought battle between opposing parties. Sometimes district lines are so hotly contested that the Supreme Court is forced to intervene. Whether or not anyone believes there is any wrong doing amongst the legislators, t...
متن کاملA Quadratic Programming Model for Political Districting Problem
Political Districting Problem is one of the critical issues in political elections, it can be expressed as: how to partition a state into reasonable districts for parliament election and presidential election. In this paper, the political districting problem for parliament election is modelled as a doubly weighted graph partition problem and it is formulated into quadratic programming model. Us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2021
ISSN: ['1572-9338', '0254-5330']
DOI: https://doi.org/10.1007/s10479-021-04227-5